二次Lagrangian有限元方程的几何多重网格法

为了构造快速求解二次Lagrangian有限元方程的几何多重网格法,在选择二次Lagrangian有限元空间和一系列线性Lagrangian有限元空间分别作为最细网格层和其余粗网格层以及构造一种新限制算子的基础上,提出了一种新的几何多重网格法,并对它的计算量进行了估计.数值实验结果,与通常的几何多重网格法和AMG01法相比,表明了新算法计算量少且稳健性强.     

ON TWO CONJECTURES OF THE QUADRATIC DIFFERENTIAL SYSTEMS

ＯＮＴＷＯＣＯＮＪＥＣＴＵＲＥＳＯＦＴＨＥＱＵＡＤＲＡＴＩＣＤＩＦＦＥＲＥＮＴＩＡＬＳＹＳＴＥＭＳＺＨＡＮＧＸＩＡＮＧ＊ＡｂｓｔｒａｃｔＭａｎｕｓｃｒｉｐｔｒｅｃｅｉｖｅｄＳｅｐｔｅｍｂｅｒ２９，１９９５．＊ＩｎｓｔｉｔｕｔｅｏｆＭａｔｈｅｍａｔｉｃ...     

Invariants of trace forms in odd characteristic and authentication codes

We complete A. Klapper's work on the invariant of a one-term trace form over a finite field of odd characteristic. We apply this to computing the probability of a successful impersonation attack on an authentication code proposed by C. Ding et al. (2005).     

Comments on “On stability of switched homogeneous nonlinear systems” by Lijun Zhang, Sheng Liu, and Hai Lan [J. Math. Anal. Appl. 334 (1) (2007) 414-430]

We show that the proof of the results obtained in the above paper is wrong since it is based on lemma which is not true. Therefore the results of the paper cannot be considered as true ones.     

多目标模糊系数规划

在单目标模糊系数规划的理论基础上，对多目标模糊系数规划进行讨论，在以目标间的协调程度尽可能大为最优性条件的要求下提出多目标模糊系数规划最优解的定义，并给出一种可行的求解方法。     

A congruence for the Fourier coefficients of a modular form and its application to quadratic forms

Let F(z)=∑ _n=1^∞ A(n)q ⁿ denote the unique weight 6 normalized cuspidal eigenform on Γ₀(4). We prove that A(p)≡0,2,−1(mod 11) when p≠11 is a prime. We then use this congruence to give an application to the number of representations of an integer by quadratic form of level 4.      

Partial Lagrangian relaxation for general quadratic programming

We give a complete characterization of constant quadratic functions over an affine variety. This result is used to convexify the objective function of a general quadratic programming problem (Pb) which contains linear equality constraints. Thanks to this convexification, we show that one can express as a semidefinite program the dual of the partial Lagrangian relaxation of (Pb) where the linear constraints are not relaxed. We apply these results by comparing two semidefinite relaxations made from two sets of null quadratic functions over an affine variety.      

模糊批量生产计划问题的可信性规划模型与算法

描述模糊单位利润、模糊生产能力以及模糊需求下的批量生产计划,并应用可信性规划建立了模型.当模糊变量是梯形模糊数时,我们将模糊模型转化为确定意义下的模型.为了求解优化模型,我们设计了基于模糊模拟的遗传算法.最后,通过一个数值例子说明算法的有效性.     

Modular Properties of Theta-Functions and Representation of Numbers by Positive Quadratic Forms

By means of the theory of modular forms the formulas for a number of representations of positive integers by two positive quaternary quadratic forms of steps 36 and 60 and by all positive diagonal quadratic forms with seven variables of step 8 are obtain.     

Sufficient Conditions for Global Optimality of Bivalent Nonconvex Quadratic Programs with Inequality Constraints

We present sufficient conditions for the global optimality of bivalent nonconvex quadratic programs involving quadratic inequality constraints as well as equality constraints. By employing the Lagrangian function, we extend the global subdifferential approach, developed recently in Jeyakumar et al. (J. Glob. Optim., 2007, to appear; Math. Program. Ser. A, 2007, to appear) for studying bivalent quadratic programs without quadratic constraints, and derive global optimality conditions. The authors are grateful to the referees for constructive comments and suggestions which have contributed to the final preparation of the paper. Z.Y. Wu’s current address: School of Information Technology and Mathematical Sciences, University of Ballarat, Ballarat, Victoria, Australia. The work of this author was completed while at the Department of Applied Mathematics, University of New South Wales, Sydney, Australia.